Carlson iterating rational approximation and performance analysis of fractional operator with arbitrary order
He Qiu-Yan1, Yu Bo2, Yuan Xiao1, †
College of Electronics and Information Engineering, Sichuan University, Chengdu 610065, China
College of Physics and Engineering, Chengdu Normal University, Chengdu 611130, China

 

† Corresponding author. E-mail: sichuanyuanxiao@sina.com

Abstract

The performance analysis of the generalized Carlson iterating process, which can realize the rational approximation of fractional operator with arbitrary order, is presented in this paper. The reasons why the generalized Carlson iterating function possesses more excellent properties such as self-similarity and exponential symmetry are also explained. K-index, P-index, O-index, and complexity index are introduced to contribute to performance analysis. Considering nine different operational orders and choosing an appropriate rational initial impedance for a certain operational order, these rational approximation impedance functions calculated by the iterating function meet computational rationality, positive reality, and operational validity. Then they are capable of having the operational performance of fractional operators and being physical realization. The approximation performance of the impedance function to the ideal fractional operator and the circuit network complexity are also exhibited.

1. Introduction

Fractional calculus has been widely used in the areas of viscoelasticity,[1] diffusion,[2] random processes,[3] nonlinear dynamics and chaos,[4] etc. Particularly, the rational approximation problem of fractional operator has also become a hot spot of research in recent years, where s is the complex frequency variable or the operational variable in the Laplace transform domain and μ is called the operational order whose value is the fraction or the rational number, namely . According to network synthesis, the rational impedance function sequence (the iterating time ) which could be realized with circuit elements, has been used to implement the approximation of the irrational fractional operator function under certain conditions and over a certain frequency range:

where these positive integer parameters nk and dk represent the highest degree of numerator polynomial and denominator polynomial respectively, βki and αki express correspondingly coefficients of and . The two-terminal circuit element whose impedance function is , is referred as the μ-order ideal fractor. Its lumped characteristic parameter is called the fractance quantity.[57] Fractance is the abbreviation of fractional-order impedance. The unit of the physical quantity in the SI unit is , which is named the Ohm μ-order second. The dimension of the physical quantity is dim . The two-terminal circuit network of impedance function in Eq. (1) is called the fractance approximation circuit,[7] which takes on the operational characteristics of ideal fractional operator in a certain frequency range.

In the early 1950s and 1960s, the regular Newton iterating process was proposed by Carlson and Halijak to realize the rational approximation of fractional operator (n denotes an integer equal to or greater than 2).[8,9] The binomial expansion method was put forward by Steiglitz et al. to implement the rational approximation of the negative half order operator.[10,11] In the modeling study of constant-argument immittance, Roy made use of the continued fraction expansion to achieve the rational approximation of fractional operator .[12] From the beginning of this century, order fractance approximation circuit through the Carlson regular Newton iterating process, Carlson iterating process for short, was designed in Ref. [13]. The generalization of the binomial expansion method to obtain the rational approximation impedance function sequence for an arbitrary order fractional operator was presented in Ref. [14]. The rational approximation of fractional operator by variable substitution was also achieved by Krishna et al. based on the study of Roy.[15,16] Using the continued fraction expansion method to design order fractance approximation circuit was accomplished in Ref. [17]. There are also other methods to implement the rational approximation of fractional operator, such as the elliptic function approximation method,[18,19] the Padé rational approximation method,[20,21] and so on.

In many rational approximation methods, the Carlson iterating process about operator has made more and more people attach comprehensive importance to it. Nowadays, when mentioning the study history of fractance and fractance approximation circuit, people would date back to the Carlson iterating process. The impedance function sequence acquired by the Carlson iterating process could approximate to the operator and extend to both high and low frequency uniformly, smoothly and steadily.[7,13] The K-index[7] is equal to . That is to say, for every one increase in the iterating time k, the increasing frequency band is almost up to 1.7–1.9 orders of magnitude. It is certainly useful that the Carlson iterating process could realize the rational approximation of fractional operator .

The generalized Carlson iterating process which is to achieve the rational approximation of arbitrary order fractional operator (j is also an integer valued from 1 to ) now has been verified in Refs. [7] and [22]. Performance analysis for the generalized Carlson iterating process, is discussed in this paper. We start with introducing the rational approximation principle about the generalized Carlson iterating process. Next the complexity index of fractance approximation circuit, K-index, P-index, and O-index are introduced to contribute to performance analysis. Then experiments are carried out to acquire these approximation performance indices for n varying from 2 to 5. Finally, we summarize the work of this paper, make an outlook and point out some relative topics in the further research.

2. The Carlson iterating rational approximation principle

Considering the following case in Eq. (1)

there is the generalized Carlson fratance approximation problem:
is called the Carlson limit impedance function which is a known function. , however, is an unknown function which needs to be determined. If is substituted by an unknown number xk, and the certain operator is replaced by a known positive real number a, namely , equation (3) can be written in the following form
The Carlson fractance approximation problem therefore can be converted into the algebra iterating solution of the arithmetic root of the n-th two-term equation

The classical Newton iterating formula[8,23] of solving the arithmetic root is

is the generalized Newton iterating function. To speed the convergence of the Newton iterating process, the predistortion function has been introduced
So we obtain an equivalent form of Eq. (5):
and a new iterating formula
If is substituted into Eq. (9), the numerical iterating solution of the arithmetic root r, namely the generalized Carlson iterating formula, is acquired
is the generalized Carlson iterating function. Proceeding further, we replace a with in Eq. (10) and obtain the Carlson fractance rational approximation impedance function sequence of fractional operator

When , there exists and . and are the classical Newton and Carlson iterating functions which have formerly only been used to accomplish the rational approximation of the fractional operator . and are the corresponding particular cases of and .

Let and , the Newton iterating function and the Carlson iterating function are depicted separately in Figs. 1(a) and 1(b). The both possess basic mathematical properties of the fractance approximation iterating function, such as positive root uniqueness, local convergence, global convergence, and so on.[7]

Fig. 1. (color online) Iterating function curves: (a) (linear coordinate); (b) (linear coordinate); (c) (dual logarithmic coordinate); (d) (dual logarithmic coordinate); (e) ; (f) .

In comparison with the Newton iterating process of the second order, the Carlson iterating process is of the third order and has global regularity, namely a strict global monotonic increasing property. So the convergence rate at the root is the largest possible one in the set of predistortion functions and no overshoot or undershoot occurs at the beginning of the process.[8] Besides, the Carlson iterating function also takes on some other more excellent geometrical features.

2.1. Self-similarity

For different positive real numbers a, these Carlson iterating function curves shown in Figs. 1(b), 1(c), and 1(d) are self-similar. This feature is specially obvious in the dual logarithmic coordinate, as can be seen in Figs. 1(c) and 1(d). This kind of self-similarity can make the Carlson iterating function normalized. Let (χ called the normalized variable) and , we obtain the normalized Carlson iterating function

Therefore, the shapes of these Carlson iterating function curves are the same for all values of positive real number a in the dual logarithmic coordinate.

2.2. Exponential symmetry

Let ( ) and we take the logarithmic operation on each side of Eq. (12), so the exponential form of is

Obviously, there exists , thus the function is odd-symmetric, as shown in Fig. 1(f). The exponential form of the normalized Newton iterating function is illustrated in Fig. 1(e). The exponential symmetry indicates that the frequency band of the impedance function calculated by the Carlson iterating function approximating to fractional operator , is extended to both high and low frequencies uniformly, smoothly, and steadily.[7]

3. Theoretical foundations for performance analysis of Carlson iterating rational approximation

It has been verified in Ref. [22] that the impedance function calculated by the generalized Carlson iterating function satisfies these following properties:[7,24,25]

(i) Computational rationality

There exists no irrational computation and only rational computation of complex frequency variable s in the expression of when choosing the rational initial impedance function.

(ii) Positive reality principle

Both numerator polynomial and denominator polynomial should be strict Hurwitz polynomials. In other words, all zeros and poles of the impedance function are located in the negative real axis of the s complex plane or the left-half plane of the s complex plane in conjugate pairs.

(iii) Operational validity

The impedance function takes on the operational characteristics of fractional operator over a certain complex frequency range.

Let

where is the analog frequency variable and ϖ is the frequency exponent variable, so the operational validity requires
and it can be divided into three parts as follows.

(I) Validity of the amplitude-frequency characteristics

(II) Validity of the phase-frequency characteristics

(III) Validity of the order-frequency characteristics

Take for example, the operational validity is shown in Fig. 2. The solid lines typify the frequency–domain characteristics of the impedance function with the iterating time k increasing. The dotted lines represent the frequency–domain characteristics of the ideal operator . The operational nature of fractional order elements and systems, is precisely characterized by the order–frequency characteristics and the phase–frequency characteristics.

Fig. 2. (color online) Frequency–domain characteristics curves of the impedance function with and : (a) amplitude–frequency characteristics; (b) phase–frequency characteristics; (c) order–frequency characteristics.

The impedance function meets these properties mentioned above, so it has physical realization and the operational characteristics of fractional operator . In this section, a necessary preliminary to describe the approximating degree of the impedance function to the ideal fractional operator, the performance indices are introduced. We also bring in an index to represent the complexity of the fractance approximation circuit.

3.1. Approximation performance indices: -index, -index, and -index

In order to quantitatively describe the approximation degree of the frequency–domain characteristics to the frequency characteristics , the approximation performance indices are introduced, including the slope index (K-index), the phase frequency index (P-index), and the order frequency index (O-index). Firstly, we explain the phase frequency approximation bandwidth exponent , the order frequency approximation bandwidth exponent and some other related concepts. The phase frequency approximation bandwidth exponent is the difference between the upper limit frequency exponent and the lower limit frequency exponent

In this frequency interval, the phase frequency relative error function
satisfies the relationship
where i represents the approximation precision grade index.

The order frequency approximation bandwidth exponent is also the difference between the upper limit frequency exponent and the lower limit frequency exponent

In this frequency interval, the order frequency relative error function
satisfies the relationship

The phase frequency and order frequency relative error function curves are depicted in Fig. 3 separately. The mathematical meaning of , , , , , and are also illustrated in Fig. 3.

Fig. 3. (color online) Relative error function curves with , , and : (a) phase-frequency; (b) order-frequency.

The upper limit and lower limit frequency exponent curves with the iterating time k increasing are shown in Fig. 4. and depicted in Fig. 5, are the measure values of magnitude orders of approximation bandwidth. When the iterating time k is greater than a certain positive integer, both curves of and are parallel respectively and have the following simple relationship

(25a)
(25b)
where and identify the slopes, as shown in Fig. 6. In general, the slope index, namely the K-index, identifies the increasing rate of frequency bandwidth exponent with the iterating time k varying and contents the relationship

Fig. 4. (color online) Upper limit frequency exponent and lower limit frequency exponent with and : (a) phase-frequency; (b) order-frequency.
Fig. 5. (color online) Approximation bandwidth exponent curves with and : (a) phase-frequency; (b) order-frequency.
Fig. 6. (color online) Slopes of approximation bandwidth exponent curves with and : (a) phase-frequency; (b) order-frequency.

The geometrical interpretation of Pi and Oi are the intersection points of the vertical coordinate and the extended line segments of and curves respectively, as shown in Fig. 5. To describe the whole approximation performance, the P-index and O-index are denoted by the arithmetic mean of Pi and Oi separately,

The greater the values of K-index, P-index, and O-index, the better the approximation performance of the impedance function to the ideal fractional operator .

3.2. Iterating algorithm of coefficient vectors and complexity of fractance approximation circuit

The coefficient vectors and of numerator polynomial and denominator polynomial are given as follows:

(28a)
(28b)
where the degrees are in descending arrangement.

Let used in Eq. (11) and we can rewrite the rational approximation impedance function sequence of fractional operator in the other form:

Corresponding to this, the iterating formulae of coefficient vectors and are obtained,
(30a)
(30b)
where the operation symbol * denotes convolution and
(31a)
(31b)
The aim of using the zero padding operation is to utilize the matrix operations, which can reduce the amount of calculation. The degrees nk and dk of the impedance function are decided by the degrees n0 and d0 of the initial impedance, the iterating time k and the operational order μ, then there exists
(32a)
(32b)
(32c)

According to the network synthesis theory, we could use available electrical and electronic elements, such as resistors or capacitors, to design the fractance approximation circuit of impedance function . The degree of the impedance function

indicates how many independent dynamic elements such as capacitors and inductors are used in the network. So we make as a measure index of the complexity of the fractance approximation circuit.

4. Performance analysis
4.1. Performance analysis of Carlson iterating rational approximation

Given the appropriate initial impedance , the impedance function and coefficient vectors and are calculated by the iterating formulae.

Firstly, take for example. Let

the coefficient vectors and the zero-pole distributions of impedance functions with the iterating time k equaling several initial values, are listed in the following Table 1. Except there is a pole in the origin, other zeros and poles are distributed in the left-half plane of the s complex plane. Thus these impedance functions meet the positive reality principle. As can be seen from Fig. 2, the frequency bandwidths of the impedance functions approximating to the fractional operator are gradually increasing with the iterating time k increasing. Therefore, these impedance functions possess the operational validity.

Table 1.

Coefficient vectors and zero-pole distributions of impedance functions with and .

.

From the above discussion, the impedance function calculated by the iterating formula with the initial impedance , meets all these properties which the fractance impedance function should own, and it is capable of having the operational performance of operator and being physically realized.

The K-index as shown in Fig. 6 is

This means that if the iterating time k increases by 1, then the approximation frequency bandwidth exponent will increase by 1.8062. The P-index and O-index are respectively equal to the following values

From Table 1, the degree of denominator polynomial is higher than that of the nominator polynomial of the impedance function, that is

After the common terms between numerator and denominator polynomials have been cancelled, there exists
Thus the complexity of fractance approximation circuit with impedance function

Taking nine different kinds of operational orders with into consideration and choosing an appropriate rational initial impedance function for a certain operational order, we analyze the approximation performance of impedance function to ideal fractional operator , acquire circuit complexity and make a summary as shown in Table 2. For order with a resistor as the initial impedance and order with a capacitor as the initial impedance, both have the same K-index which is approximately equal to . The latter uses one more capacitor than the former. With the increasing of the absolute values of operational orders, the K-index is decreasing. With the increasing of n, the complexity of the fractance approximation circuit also increases.

Table 2.

Performance analyses of different fractional operators.

.
4.2. Performance comparison

As we all know, the Liu-Kaplan chain fractance also can realize the rational approximation of fractional operator with arbitrary order. So performance comparison between Liu–Kaplan chain fractance and the generalized Carlson iterating rational approximation has been made in this paper, as shown in Figs. 7 and 8.

Fig. 7. (color online) The generalized Carlson iterating rational approximation with : (a) phase–frequency characteristics; (b) order–frequency characteristics.
Fig. 8. (color online) Liu–Kaplan chain fractance with the length of operational frequency window equal to 1 and : (a) phase-frequency characteristics; (b) order-frequency characteristics.

The approximation frequency–domain characteristics curves of the impedance function calculated by the generalized Carlson iterating function are relatively smooth over a certain frequency range. The Liu–Kaplan chain franctance exists as an operational oscillating phenomena.[2629] The wider the length of operational frequency window of the Liu–Kaplan chain fractance, the larger the oscillating magnitude.

5. Conclusion

The performance analysis of the generalized Carlson iterating process of fractional operator with arbitrary order has been explored in this paper. In addition, the unit and dimension of the physical quantity are given in this paper, which is useful in the future study. For some special orders, are called in different particular forms, for example, is called Ohm square root second (Ohm root second for short), is Ohm cube root second, is Ohm n-th root second, is Ohm per square root second, is Ohm per cube root second, is Ohm per n-th root second. In further researches, some subjects are to be solved as follows.

i) We attempt to obtain the analytical expressions of zeros and poles of the impedance function, so it is easy to judge the stability and analyze the approximation performance of the circuit network to the fractional operator from zero-pole analytical expressions.

ii) The K-index of the Carlson iterating process approximating to the fractional operator has already been known, how about the K-index with j equal to or greater than 2? Investigating the theoretical expression of the K-index should receive significant attention.

iii) We utilize passive or active elements to design an arbitrary order fractance approximation circuit which is used as a fractional order element to realize arbitrary order fractional calculus. The best situation is to make fractional order capacitors and inductors available in the market, just like normal capacitors and inductors are. Furthermore, a great deal of interest exists in modelling and studying fractional order phenomena and processes in the nature.

Reference
[1] Hu K X Zhu K Q 2009 Chin. Phys. Lett. 26 108301
[2] Kumar R Gupta V 2013 Chin. Phys. 22 074601
[3] Ghany H A Hyder A A 2014 Chin. Phys. 23 060503
[4] Wang F Q Ma X K 2013 Chin. Phys. 22 120504
[5] Yu B Yuan X Tao L 2015 J. Electr. Inf. Technol. 37 21
[6] Pu Y F Yuan X 2016 IEEE Access 4 1872
[7] Yuan X 2015 mathematical Principles of Fractance Approximation Circuits Beijing Science Press 218 256
[8] Carlson G Halijak C 1962 IRE Trans. Circuit Theory 9 302
[9] Carlson G Halijak C 1964 IEEE Trans. Circuit Theory 11 210
[10] Steiglits K 1964 IEEE Trans. Circuit Theory 11 160
[11] Halijak C 1964 IEEE Trans. Circuit Theory 11 494
[12] Roy S D 1967 IEEE Trans. Circuit Theory 14 264
[13] Liao K Yuan X Pu Y F Zhou J L 2006 J. Sichuan Univ. (Nat. Sci. Edn.) 43 104
[14] Ren Y Yuan X 2008 J. Sichuan Univ. (Nat. Sci. Edn.) 45 1100
[15] Krishna B T Reddy K V V S 2008 Acta Passive Electron. Compon. 2008 369421
[16] Krishna B T 2011 Signal Process. 91 386
[17] Liu Y Pu Y F Shen X D Zhou J L 2012 J. Sichuan Univ. (Eng. Sci. Edn.) 44 153
[18] Chen Y Q Vinagre B M Podlubny I 2004 Nonlinear Dynam. 38 155
[19] Onat C Sahin M Yaman Y 2012 Aircr. Eng. Aerosp. Tec. 84 203
[20] Sun H H Abdelwahab A A Onaral B 1984 IEEE T. Automat. Control 29 441
[21] Zou D Yuan X Tao C Q Yang Q 2013 J. Sichuan Univ. (Nat. Sci. Edn.) 50 293
[22] He Q Y Yuan X 2016 Acta Phys. Sin. 65 160202 in Chinese
[23] Editorial Board 2002 Mathematics Dictionary Taiyuan Education Press
[24] Valkenburg V M E 1982 Network Synthesis Beijing Science Press Yang X J Zheng J L Yang W L 222 225 in Chinese
[25] Zu Y X Lu Y Q 2007 Network Analysis and Synthesis Beijing China Machine Press 111 120 in Chinese
[26] Liu S H 1985 Phys. Rev. Lett. 55 529
[27] Kaplan T Gray L J 1985 Phys. Rev. 32 7360
[28] Kaplan T Liu S H Gray L J 1986 Phys. Rev. 34 4870
[29] Kaplan T Gray L J Liu S H 1987 Phys. Rev. 35 5379